using partitioning and non-partitioning clustering algorithms for included proteins sequences in esophagus, stomach and colon cancer
نویسندگان
چکیده
a thorough recognition of the nature and duties of the genes is based upon having adequate information about the proteins. however, the proteomic projects follow a slow trend; therefore, solving the protein-related problems has become as one of the most important challenges in bio-informatics. consequently, the presence of tools which can enhance the structural recognition, classification, and interpretation of proteins will be advantageous. statistical methods are among the tools to help solve bio-informatics problems. these methods may be used to help predict the third structures of proteins, study proteins collectively, as well as extract new interactions among the protein collections. one of the very efficient and useful methods in the collective study of protein subsets is the cluster analysis. in the present study, the recognized protein sequences related to esophagus, stomach, and colon cancers are analyzed through partitioning, non-partitioning, and fuzzy clustering methods. needleman-wunsch global alignment algorithm was used to determine pair-wise similarities. the evaluations have shown that the clusters obtained through using the agnes method have produced more powerful structures; yet, it can be said that the pam clustering method, compared to other ones, has produced the best results in predicting ability of the 3d structure of the unknown protein sequences.
منابع مشابه
Streaming Algorithms for Partitioning Integer Sequences
We study the problem of partitioning integer sequences in the one-pass data streaming model. Given is an input stream of integers X ∈ {0, 1, . . . ,m} of length n with maximum element m, and a parameter p. The goal is to output the positions of separators splitting the input stream into p contiguous blocks such that the maximal weight of a block is minimized. We show that computing an optimal s...
متن کاملClustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms
Previous research has resulted in a number of different algorithms for rule discovery. Two approaches discussed here, the ‘all-rules’ algorithm and multiobjective metaheuristics, both result in the production of a large number of partial classification rules, or ‘nuggets’, for describing different subsets of the records in the class of interest. This paper describes the application of a number ...
متن کامل(Semi-)External Algorithms for Graph Partitioning and Clustering
In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propagation technique. Our (semi-)external size-constrained label propagation algori...
متن کاملEecient Parallel Algorithms for Geometric Clustering and Partitioning Problems
We present eecient parallel algorithms for some geometric clustering and partitioning problems. Our algorithms run in the CREW PRAM model of parallel computation. Given a point set P of n points in two dimensions, the clustering problems are to nd a k-point subset such that some measure for this subset is minimized. We consider the problems of nding a k-point subset with minimum L 1 perimeter a...
متن کاملClustering of Defect Reports Using Graph Partitioning Algorithms
We present in this paper several solutions to the challenging task of clustering software defect reports. Clustering defect reports can be very useful for prioritizing the testing effort and to better understand the nature of software defects. Despite some challenges with the language used and semi-structured nature of defect reports, our experiments on data collected from the open source proje...
متن کاملHypergraph Partitioning and Clustering
A hypergraph is a generalization of a graph wherein edges can connect more than two vertices and are called hyperedges. Just as graphs naturally represent many kinds of information in mathematical and computer science problems, hypergraphs also arise naturally in important practical problems, including circuit layout, Boolean SATisfiability, numerical linear algebra, etc. Given a hypergraph H ,...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of paramedical sciencesجلد ۲، شماره ۲، صفحات ۰-۰
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023